Anderson‐accelerated polarization schemes for fast Fourier transform‐based computational homogenization

نویسندگان

چکیده

Classical solution methods in fast Fourier transform-based computational micromechanics operate on, either, compatible strain fields or equilibrated stress fields. By contrast, polarization schemes are primal-dual whose iterates neither nor equilibrated. Recently, it was demonstrated that may outperform the classical methods. Unfortunately, their power critically depends on a judicious choice of numerical parameters. In this work, we investigate extension by Anderson acceleration and demonstrate combination leads to robust general-purpose solvers for micromechanics. We discuss (theoretically) optimum parameter methods, describe how fits into picture, exhibit characteristics newly designed problems industrial scale interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

calculation of computational complexity for radix-2p fast fourier transform algorithms for medical signals

due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...

متن کامل

Fast Communication a Fast Algorithm for Reiterated Homogenization

Abstract. This paper considers the numerical evaluation of effective coefficients for multiscale homogenization problems and proposes a highly efficient algorithm for a certain class of reiterated homogenization problems of practical importance. The main idea of the proposed approach is to introduce a novel object called the homogenization map, approximate it through adaptive interpolation, and...

متن کامل

Grating theory: new equations in Fourier space leading to fast converging results for TM polarization.

Using theorems of Fourier factorization, a recent paper [J. Opt. Soc. Am. A 13, 1870 (1996)] has shown that the truncated Fourier series of products of discontinuous functions that were used in the differential theory of gratings during the past 30 years are not converging everywhere in TM polarization. They turn out to be converging everywhere only at the limit of infinitely low modulated grat...

متن کامل

A Fast Immersed Boundary Fourier Pseudo-spectral Method for Simulation of the Incompressible Flows

Abstract   The present paper is devoted to implementation of the immersed boundary technique into the Fourier pseudo-spectral solution of the vorticity-velocity formulation of the two-dimensional incompressible Navier-Stokes equations. The immersed boundary conditions are implemented via direct modification of the convection and diffusion terms, and therefore, in contrast to some other similar ...

متن کامل

Calculation of Computational Complexity for Radix-2p Fast Fourier Transform Algorithms for Medical Signals

Owing to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. Radix-2(p) algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2. By defining a new concept, twiddle factor template, in this paper, we propose a method for exact calculation of multiplicative complexity for radix-2(p) algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal for Numerical Methods in Engineering

سال: 2021

ISSN: ['0029-5981', '1097-0207']

DOI: https://doi.org/10.1002/nme.6622